Dynamic monopolies with randomized starting configuration
نویسنده
چکیده
Properties of systems with majority voting rules have been exhaustingly studied. In this work we focus on the randomized case where the system is initialized by randomized initial set of seeds. Our main aim is to give an asymptotic estimate for sampling probability, such that the initial set of seeds is (is not) a dynamic monopoly almost surely. After presenting some trivial examples, we present exhaustive results for toroidal mesh and random 4-regular graph under simple majority scenario.
منابع مشابه
Remarks on dynamic monopolies with given average thresholds
Dynamic monopolies in graphs have been studied as a model for spreading processes within networks. Together with their dual notion, the generalized degenerate sets, they form the immediate generalization of the classical notions of vertex covers and independent sets in a graph. We present results concerning dynamic monopolies in graphs of given average threshold values extending and generalizin...
متن کاملRegulation of Monopolies A Randomized Approach *)
Two formal models are proposed to describe the gains of randomizing the regulation and price control of monopolies. In the first model, a monopolist faces a nonzero probability of being regulated by the authorities due its pricing policy. This leads to a self-regulation. Threat of regulation induces monopoly to pay a risk premium to consumers in a form of reduced product price. The analytical s...
متن کاملDynamic Monopolies of Constant Size
This paper deals with a polling game on a graph. Initially, each vertex is colored white or black. At each round, each vertex is colored by the color shared by the majority of vertices in its neighborhood. (All recolorings are done simultaneously). We say that a set W0 of vertices is a dynamic monopoly or dynamo if starting the game with the vertices ofW0 colored white, the entire system is whi...
متن کاملGeneralized degeneracy, dynamic monopolies and maximum degenerate subgraphs
A graph G is said to be a k-degenerate graph if any subgraph of G contains a vertex of degree at most k. Let κ be any non-negative function on the vertex set of G. We first define a κ-degenerate graph. Next we give an efficient algorithm to determine whether a graph is κ-degenerate. We revisit the concept of dynamic monopolies in graphs. The latter notion is used in formulation and analysis of ...
متن کاملOn dynamic monopolies of graphs with general thresholds
Let G be a graph and τ : V (G) → N be an assignment of thresholds to the vertices ofG. A subset of verticesD is said to be dynamic monopoly (or simply dynamo) if the vertices of G can be partitioned into subsets D0,D1, . . . ,Dk such that D0 = D and for any i = 1, . . . , k − 1 each vertex v in Di+1 has at least t(v) neighbors in D0∪ . . .∪Di. Dynamic monopolies are in fact modeling the irrever...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 412 شماره
صفحات -
تاریخ انتشار 2011